Search Results

Documents authored by Nicol, David M.

Found 2 Possible Name Variants:

Nicol, David M.

Document
DOI: 10.4230/DagRep.12.10.1
Computer Science Methods for Effective and Sustainable Simulation Studies (Dagstuhl Seminar 22401)

Authors: Wentong Cai, Christopher Carothers, David M. Nicol, and Adelinde M. Uhrmacher

Published in: Dagstuhl Reports, Volume 12, Issue 10 (2023)

Abstract
This report documents the program and the (preliminary) outcomes of Dagstuhl Seminar 22401 "Computer Science Methods for Effective and Sustainable Simulation Studies". The seminar has been dedicated to addressing central methodological challenges in conducting effective and sustainable simulation studies. Lightning talks provided the opportunity for participants to present their current research and ideas to advance methodological research in modeling and simulation. However, the lion’s share of the seminar was dedicated to working groups. One working group investigated how machine learning and modeling and simulation can be effectively integrated (Intelligent Modeling and Simulation Lifecycle). Another working group focused on methodological challenges to support policy via simulation (Policy by simulation: seeing is believing for interactive model co-creation and effective intervention). A third working group identified 4 challenges closely tied to the quest for sustainable simulation studies (Context, composition, automation, and communication - towards sustainable simulation studies) thereby, focusing on the role of model-based approaches and related methods.
Cite as

Wentong Cai, Christopher Carothers, David M. Nicol, and Adelinde M. Uhrmacher. Computer Science Methods for Effective and Sustainable Simulation Studies (Dagstuhl Seminar 22401). In Dagstuhl Reports, Volume 12, Issue 10, pp. 1-60, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)

Copy BibTex To Clipboard

@Article{cai_et_al:DagRep.12.10.1,
  author =	{Cai, Wentong and Carothers, Christopher and Nicol, David M. and Uhrmacher, Adelinde M.},
  title =	{{Computer Science Methods for Effective and Sustainable Simulation Studies (Dagstuhl Seminar 22401)}},
  pages =	{1--60},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2023},
  volume =	{12},
  number =	{10},
  editor =	{Cai, Wentong and Carothers, Christopher and Nicol, David M. and Uhrmacher, Adelinde M.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.12.10.1},
  URN =		{urn:nbn:de:0030-drops-178196},
  doi =		{10.4230/DagRep.12.10.1},
  annote =	{Keywords: Modeling, simulation, high performance computing, machine learning, visual analytics}
}
Document
DOI: 10.4230/DagSemProc.06161.1
06161 Abstracts Collection – Simulation and Verification of Dynamic Systems

Authors: David M. Nicol, Corrado Priami, Hanne Riis-Nielson, and Adelinde M. Uhrmacher

Published in: Dagstuhl Seminar Proceedings, Volume 6161, Simulation and Verification of Dynamic Systems (2006)

Abstract
From 17.04.06 to 22.04.06, the Dagstuhl Seminar 06161 ``Simulation and Verification of Dynamic Systems'' was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available.
Cite as

David M. Nicol, Corrado Priami, Hanne Riis-Nielson, and Adelinde M. Uhrmacher. 06161 Abstracts Collection – Simulation and Verification of Dynamic Systems. In Simulation and Verification of Dynamic Systems. Dagstuhl Seminar Proceedings, Volume 6161, pp. 1-13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)

Copy BibTex To Clipboard

@InProceedings{nicol_et_al:DagSemProc.06161.1,
  author =	{Nicol, David M. and Priami, Corrado and Riis-Nielson, Hanne and Uhrmacher, Adelinde M.},
  title =	{{06161 Abstracts Collection – Simulation and Verification of Dynamic Systems}},
  booktitle =	{Simulation and Verification of Dynamic Systems},
  pages =	{1--13},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2006},
  volume =	{6161},
  editor =	{David M. Nicol and Corrado Priami and Hanne Riis Nielson and Adelinde M. Uhrmacher},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.06161.1},
  URN =		{urn:nbn:de:0030-drops-7102},
  doi =		{10.4230/DagSemProc.06161.1},
  annote =	{Keywords: Modeling, Simulation, Verification, Dynamic Systems, Systemsbiology}
}
Document
DOI: 10.4230/DagSemProc.06161.2
06161 Executive Summary – Simulation and Verification of Dynamic Systems

Authors: Hanne Riis-Nielson, David M. Nicol, Corrado Priami, and Adelinde M. Uhrmacher

Published in: Dagstuhl Seminar Proceedings, Volume 6161, Simulation and Verification of Dynamic Systems (2006)

Abstract
Simulation is widely used for modeling engineering artifacts and natural phenomena to gain insight into the operation of those systems. Formal verification is concerned with proving or disproving the correctness of a system with respect to a certain property. Despite of these different objectives, the fields of simulation and verification address similar research challenges. Particularly, in the application area systems biology simulation and verification are moving together. The Dagstuhl Seminar was dedicated to intensifying this dialogue, and stimulating the exchange of ideas. Three working groups discussed questions: Why are biological systems difficult to model?, What role does refinement and abstraction play in combining simulation and verification?, What is the role of communication and composition in simulating and analysing dynamic systems? The results of the working groups can be found in the working groups' report.
Cite as

Hanne Riis-Nielson, David M. Nicol, Corrado Priami, and Adelinde M. Uhrmacher. 06161 Executive Summary – Simulation and Verification of Dynamic Systems. In Simulation and Verification of Dynamic Systems. Dagstuhl Seminar Proceedings, Volume 6161, pp. 1-2, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)

Copy BibTex To Clipboard

@InProceedings{riisnielson_et_al:DagSemProc.06161.2,
  author =	{Riis-Nielson, Hanne and Nicol, David M. and Priami, Corrado and Uhrmacher, Adelinde M.},
  title =	{{06161 Executive Summary – Simulation and Verification of Dynamic Systems}},
  booktitle =	{Simulation and Verification of Dynamic Systems},
  pages =	{1--2},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2006},
  volume =	{6161},
  editor =	{David M. Nicol and Corrado Priami and Hanne Riis Nielson and Adelinde M. Uhrmacher},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.06161.2},
  URN =		{urn:nbn:de:0030-drops-7028},
  doi =		{10.4230/DagSemProc.06161.2},
  annote =	{Keywords: Modelling, Simulation, Verification, Systemsbiology}
}

David, Nicolas

Document
DOI: 10.4230/LIPIcs.CONCUR.2017.14
Coverability Synthesis in Parametric Petri Nets

Authors: Nicolas David, Claude Jard, Didier Lime, and Olivier H. Roux

Published in: LIPIcs, Volume 85, 28th International Conference on Concurrency Theory (CONCUR 2017)

Abstract
We study Parametric Petri Nets (PPNs), i.e., Petri nets for which some arc weights can be parameters. In that setting, we address a problem of parameter synthesis, which consists in computing the exact set of values for the parameters such that a given marking is coverable in the instantiated net. Since the emptiness of that solution set is already undecidable for general PPNs, we address a special case where parameters are used only as input weights (preT-PPNs), and consequently for which the solution set is downward-closed. To this end, we invoke a result for the representation of upward closed set from Valk and Jantzen. To use this procedure, we show we need to decide universal coverability, that is decide if some marking is coverable for every possible values of the parameters. We therefore provide a proof of its EXPSPACE-completeness, thus settling the previously open problem of its decidability. We also propose an adaptation of this reasoning to the case of parameters used only as output weights (postT-PPNs). In this case, the condition to use this procedure can be reduced to the decidability of the existential coverability, that is decide if there exists values of the parameters making a given marking coverable. This problem is known decidable but we provide here a cleaner proof, providing its EXPSPACE-completeness, by reduction to Omega Petri Nets.
Cite as

Nicolas David, Claude Jard, Didier Lime, and Olivier H. Roux. Coverability Synthesis in Parametric Petri Nets. In 28th International Conference on Concurrency Theory (CONCUR 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 85, pp. 14:1-14:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)

Copy BibTex To Clipboard

@InProceedings{david_et_al:LIPIcs.CONCUR.2017.14,
  author =	{David, Nicolas and Jard, Claude and Lime, Didier and Roux, Olivier H.},
  title =	{{Coverability Synthesis in Parametric Petri Nets}},
  booktitle =	{28th International Conference on Concurrency Theory (CONCUR 2017)},
  pages =	{14:1--14:16},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-048-4},
  ISSN =	{1868-8969},
  year =	{2017},
  volume =	{85},
  editor =	{Meyer, Roland and Nestmann, Uwe},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2017.14},
  URN =		{urn:nbn:de:0030-drops-77831},
  doi =		{10.4230/LIPIcs.CONCUR.2017.14},
  annote =	{Keywords: Petri net, Parameters, Coverability, Unboundedness, Synthesis}
}
Document
Informal Presentation
DOI: 10.4230/OASIcs.SynCoP.2015.103
Discrete Parameters in Petri Nets (Informal Presentation)

Authors: Nicolas David, Claude Jard, Didier Lime, and Olivier H. Roux

Published in: OASIcs, Volume 44, 2nd International Workshop on Synthesis of Complex Parameters (SynCoP'15) (2015)

Abstract
With the aim of significantly increasing the modeling capability of Petri nets, we suggest models that involve parameters to represent the weights of arcs, or the number of tokens in places. We call these Petri nets parameterised nets or PPNs. Indeed, the introduction of parameters in models aims to improve genericity. It therefore allows the designer to leave unspecified aspects, such as those related to the modeling of the environment. This increase in modeling power usually results in greater complexity in the analysis and verification of the model. Here, we consider the property of coverability of markings. Two general questions arise: "Is there a parameter value for which the property is satisfied?" and "Does the property hold for all possible values of the parameters?". We first study the decidability of these issues, which we show to be undecidable in the general case. Therefore, we also define subclasses of parameterised networks, based on restriction of the use of parameters, depending on whether the parameters are used on places, input or output arcs of transitions or combinations of them. Those subclasses have therefore a dual interest. From a modeling point of view, restrict the use of parameters to tokens, outputs or inputs can be seen as respectively processes or synchronisation of a given number of processes. From a theoretical point of view, it is interesting to introduce those subclasses of PPN in a concern of completeness of the study. We study the relations between those subclasses and prove that, for some subclasses, certain problems become decidable, making these subclasses more usable in practice.
Cite as

Nicolas David, Claude Jard, Didier Lime, and Olivier H. Roux. Discrete Parameters in Petri Nets (Informal Presentation). In 2nd International Workshop on Synthesis of Complex Parameters (SynCoP'15). Open Access Series in Informatics (OASIcs), Volume 44, p. 103, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)

Copy BibTex To Clipboard

@InProceedings{david_et_al:OASIcs.SynCoP.2015.103,
  author =	{David, Nicolas and Jard, Claude and Lime, Didier and Roux, Olivier H.},
  title =	{{Discrete Parameters in Petri Nets}},
  booktitle =	{2nd International Workshop on Synthesis of Complex Parameters (SynCoP'15)},
  pages =	{103--103},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-939897-82-8},
  ISSN =	{2190-6807},
  year =	{2015},
  volume =	{44},
  editor =	{Andr\'{e}, \'{E}tienne and Frehse, Goran},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.SynCoP.2015.103},
  URN =		{urn:nbn:de:0030-drops-56046},
  doi =		{10.4230/OASIcs.SynCoP.2015.103},
  annote =	{Keywords: Petri nets, Parameters, Coverability}
}
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact